Finite simple automorphism groups of edge-transitive maps
نویسندگان
چکیده
Building on earlier results for regular maps and orientably chiral maps, we classify the non-abelian finite simple groups arising as automorphism of in each 14 Graver–Watkins classes edge-transitive maps.
منابع مشابه
AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملThe automorphism groups of non-edge-transitive rose window graphs
In this paper, we will determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this will complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we deter...
متن کاملOn classifying finite edge colored graphs with two transitive automorphism groups
This paper classifies all finite edge colored graphs with doubly transitive automorphism groups. This result generalizes the classification of doubly transitive balanced incomplete block designs with 1 and doubly transitive one-factorizations of complete graphs. It also provides a classification of all doubly transitive symmetric association schemes. The classification of finite simple groups i...
متن کاملDistance Transitive Graphs and Finite Simple Groups
This paper represents the first step in the classification of finite primitive distance transitive graphs. In it we reduce the problem to the case where the automorphism group is either almost simple or affine. Let ^ be a simple, connected, undirected graph with vertex set Q. If oc, /? e Q, then d(a, j8) denotes the distance between a and /3 in §. Let G be some group of automorphisms of §. Then...
متن کاملMost primitive groups are full automorphism groups of edge-transitive hypergraphs
We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut(X, Y ) = G for a random subset Y of X, tends to 1 as n → ∞. So the property of the title holds for all primitive groups except the alternating groups and finitely many others. This answers a question of M. H. Klin. Moreover, we give an upper bound n for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2021.07.038